NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
631	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Operations research Bin packing problem Approximation algorithm Job shop scheduling Greedy algorithm Algorithm Theoretical computer science Mathematics Applied mathematics
632	Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes R. A. Bailey, Peter J. Cameron and Robert Connelly 1 Introduction The popular Sudoku puzzle was invented, with the name “number pl Add to Reading List Source URL: www.math.cornell.edu Language: English - Date: 2006-08-27 12:36:12 Recreational mathematics Latin squares Nonassociative algebra NP-complete problems Sudoku Orthogonality Grid plan Matrix Mathematics of Sudoku Mathematics Design of experiments Algebra
633	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
634	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2013-09-02 22:22:25 NP-complete problems Graph connectivity Graph Multigraph Bridge Minimum k-cut Line graph Graph coloring Graph theory Mathematics Theoretical computer science
635	Bound Propagation for Arithmetic Reasoning in Vampire Ioan Dragan∗ , Konstantin Korovin † , Laura Kov´acs ‡ , Andrei Voronkov † ∗ Vienna University of Technology Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2013-12-12 08:44:35 Operations research Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Linear programming Local consistency Theoretical computer science Applied mathematics Mathematics
636	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
637	A Refined Complexity Analysis of Degree Anonymization on Graphs Sepp Hartung1 , Andr´e Nichterlein1 , Rolf Niedermeier1 , and Ondˇrej Such´ y2 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-03 04:36:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Degeneracy Graph Degree Vertex Neighbourhood Graph theory Theoretical computer science Mathematics
638	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
639	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
640	Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:18 Clique Cograph K-tree Matching Maximal independent set Clique-sum Graph theory Graph operations NP-complete problems

UPDATE